A Modified Genetic Algorithm(GA) for Optimization of Process Planning

نویسندگان

  • Jinfeng Wang
  • BiQiang Du
  • HaiMin Ding
چکیده

Computer-aided process planning (CAPP) is an important and complex in the computer integrated manufacturing system(CIMS). The expression methods of process knowledge based on manufacturing feature is established based on the analysis of characteristic of process knowledge. According to the constraints mong process knowledge, decision space of process planning based on process constraints is constructed which improved search efficiency of GA. In allusion to the uncertainty of decision of process planning, the multi-objective optimization function is established, and a GA is applied to optimization of process planning. Process planning is optimized using the reasonable coding strategy, fitness function, selection, crossover and mutation algorithm, etc. An case is offered to illustrate the process of optimization of process planing based on GA. Index Terms CAPP; process planning; genetic algorithm; optimization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of GA in Optimization of Modified Benzene Alkylation Process

A genetic algorithm is used to optimize the modified benzene alkylation process. Based on the previous studies, the modified process increases ethylbenzene selectivity and decreases energy consumption at the same time. The inlet ethylene flow rate of each alkylation reactor is optimized in order to reduce the chance of transalkylation reactions but increase ethylbenzene selectivity. The byprodu...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Optimization of Array Factor in Linear Arrays Using Modified Genetic Algorithm

The array factor (sidelobe level, SLL) of a linear array is optimized using modified continuous genetic algorithms in this work. The amplitudes and phases of the currents as well as the separation of the antennas are all taken as variables to be controlled. The results of the design using modified GA versions are compared with other methods. Two design problems were studied using several contin...

متن کامل

Adaptive Rule-Base Influence Function Mechanism for Cultural Algorithm

This study proposes a modified version of cultural algorithms (CAs) which benefits from rule-based system for influence function. This rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. This is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. This rule ...

متن کامل

Well Placement Optimization Using Differential Evolution Algorithm

Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011